Cannibal Animal Games: a new variant of Tic-Tac-Toe

نویسندگان

  • Jean Cardinal
  • Sébastien Collette
  • Hiro Ito
  • Matias Korman
  • Stefan Langerman
  • Hikaru Sakaidani
  • Perouz Taslakian
چکیده

This paper presents a new partial two-player game, called the cannibal animal game, which is a variant of Tic-Tac-Toe. The game is played on the infinite grid, where in each round a player chooses and occupies free cells. The first player Alice wins if she occupies a set of cells, the union of a subset of which is a translated or rotated copy of a previously agreed upon polyomino P (called an animal). The objective of the second player Bob is to prevent Alice from creating her animal by occupying in each round a translated or rotated copy of P . An animal is a cannibal if Bob has a winning strategy, and a non-cannibal otherwise. This paper presents some new tools, such as the bounding strategy and the punching lemma, to classify animals into cannibals or non-cannibals, It is also shown that the pairing strategy also works for this problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Norman Do How to Win at Tic - Tac - Toe

Undoubtedly one of the most popular pencil and paper games in the world is tic-tac-toe, also commonly known as noughts and crosses. The game has a longstanding history in many cultures across the globe. It has been posited that it may even have been played under the name of “terni lapilli” in Ancient Rome, where examples of the tic-tac-toe grid have been found etched in stone throughout the emp...

متن کامل

Quantum Tic-Tac-Toe: A Genuine Probabilistic Approach

We propose a quantum version of Tic-Tac-Toe which accurately reflects the inherent probabilistic nature of the measurement principle in quantum mechanics. We then formulate a quantum strategy which allows a quantum player to consistently win over a classical player, with a certain probability. This result can be seen as another proof of the superior computational power of a quantum system with ...

متن کامل

Discrete bidding games

We study variations on combinatorial games in which, instead of alternating moves, the players bid with discrete bidding chips for the right to determine who moves next. We consider both symmetric and partisan games, and explore differences between discrete bidding games and Richman games, which allow real-valued bidding. Unlike Richman games, discrete bidding game variations of many familiar g...

متن کامل

Cultural Evolution for Sequential Decision Tasks: Evolving Tic-Tac-Toe Players in Multi-agent Systems

Sequential decision tasks represent a difficult class of problem where perfect solutions are often not available in advance. This paper presents a set of experiments involving populations of agents that evolve to play games of tic–tac–toe. The focus of the paper is to propose that cultural learning, i.e. the passing of information from one generation to the next by non–genetic means, is a bette...

متن کامل

Strategic Insights From Playing the Quantum Tic-Tac-Toe

In this paper, we perform a minimalistic quantization of the classical game of tic-tac-toe, by allowing superpositions of classical moves. In order for the quantum game to reduce properly to the classical game, we require legal quantum moves to be orthogonal to all previous moves. We also admit interference effects, by squaring the sum of amplitudes over all moves by a player to compute his or ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JIP

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2015